Generalised multisets for chemical programming
نویسندگان
چکیده
Gamma is a programming model where computation can be seen as chemical reactions between data represented as molecules floating in a chemical solution. This model can be formalized as associative, commutative, conditional rewritings of multisets where rewrite rules and multisets represent chemical reactions and solutions, respectively. In this article, we generalize the notion of multiset used by Gamma and present applications through various programming examples. First, multisets are generalized to include rewrite rules which become first-class citizen. This extension is formalized by the γ-calculus, a chemical model that summarizes in a few rules the essence of higherorder chemical programming. By extending the γ-calculus with constants, operators, types and expressive patterns, we build a higher-order chemical programming language called HOCL. Finally, multisets are further generalized by allowing elements to have infinite and negative multiplicities. Semantics, implementation and applications of this extension are considered. Key-words: multisets, chemical programming model, rewriting, higher-order, infinite and negative multiplicities
منابع مشابه
Generalized Multisets for Chemical Programming Jean-pierre Banâtre, Pascal Fradet,
Gamma is a programming model where computation can be seen as chemical reactions between data represented as molecules floating in a chemical solution. This model can be formalized as associative, commutative, conditional rewritings of multisets where rewrite rules and multisets represent chemical reactions and solutions, respectively. In this article, we generalize the notion of multiset used ...
متن کاملGeneralized Multisets for Chemical Programming
Gamma is a programming model where computation can be seen as chemical reactions between data represented as molecules floating in a chemical solution. This model can be formalized as associative, commutative, conditional rewritings of multisets where rewrite rules and multisets represent chemical reactions and solutions, respectively. In this article, we generalize the notion of multiset used ...
متن کاملMultiset Ordering Constraints
We identify a new and important global (or non-binary) constraint. This constraint ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This constraint is useful for a number of different applications including breaking symmetry and fuzzy constraint satisfaction. We propose and implement an efficient linear time algorithm for enforcing generalised ar...
متن کاملUsing Inverted Indices for Accelerating LINGO Calculations
The ever growing size of chemical databases calls for the development of novel methods for representing and comparing molecules. One such method called LINGO is based on fragmenting the SMILES string representation of molecules. Comparison of molecules can then be performed by calculating the Tanimoto coefficient, which is called LINGOsim when used on LINGO multisets. This paper introduces a ve...
متن کاملOn Generalised Kneser Colourings
There are two possible definitions of the “s-disjoint r-uniform Kneser hypergraph” of a set system T : The hyperedges are either r-sets or r-multisets. We point out that Ziegler’s (combinatorial) lower bound on the chromatic number of an s-disjoint r-uniform Kneser hypergraph only holds if we consider r-multisets as hyperedges. We give a new proof of his result and show by example that a simila...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 16 شماره
صفحات -
تاریخ انتشار 2006